package nowcoder.day_48.day8;

import java.util.Scanner;

/**
 * 最小公倍数 = 两数之积 / 两数最大公约数
 */
public class Num2 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int m = in.nextInt();
        int n = in.nextInt();
        int mn = gdc(m , n);
        System.out.println((m * n) / mn);
    }

    /**
     * 求最大公约数
     * @param m
     * @param n
     * @return
     */
    private static int gdc(int m, int n) {
        int r;
        if (m == n){
            return m;
        }
        if (m < n){
            int temp = m;
            m = n;
            n = temp;
        }
        while ((r = (m % n)) != 0){
            m = n;
            n = r;
        }
        return n;


    }
}
